An On-Line Arithmetic-Based Recon gurable Neuroprocessor

نویسندگان

  • Jean-Luc Beuchat
  • Eduardo Sanchez
چکیده

Arti cial neural networks can solve complex problems such as time series prediction, handwritten pattern recognition or speech processing. Though software simulations are essential when one sets about to study a new algorithm, they cannot always ful ll real-time criteria required by some practical applications. Consequently, hardware implementations are of crucial import. The appearance of fast recon gurable FPGA circuits brings about new paths for the design of neuroprocessors. All arithmetic operations are carried out with on-line operators. This short paper brie y describes recon gurable FPGA-based neural networks and gives an introduction to on-line arithmetic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconngurable Computing: Architectures, Models and Algorithms Current Science: Special Section on Computational Science

ion Mapping Parameters Scheduling Figure 2: Traditional Design Synthesis Approach and the Model-based Approach One major problem in using FPGAs to speed-up a computation is the design process. The \standard CAD approach" used for digital design is typically employed (see Figure 2). The required functionality is speci ed at a high level of abstraction via an HDL or a schematic. FPGA libraries sp...

متن کامل

Constant Time Algorithms for Computing the Contour of Maximal Elements on the Recon gurable Mesh

Elements on the Recon gurable Mesh M. Manzur Murshed and Richard P. Brent Computer Sciences Lab, Research School of Information Sciences & Engg. The Australian National University, Canberra ACT 0200, Australia E-mail: fmurshed,[email protected] Abstract There has recently been an interest in the introduction of recon gurable buses to existing parallel architectures. Among them Recon gurable...

متن کامل

Automating Production of Run-Time Recon gurable Designs

This paper describes a method that automates a key step in producing run-time recon gurable designs: the identi cation and mapping of recongurable regions. In this method, two successive circuit con gurations are matched to locate the components common to them, so that recon guration time can be minimized. The circuit congurations are represented as a weighted bipartite graph, to which an e cie...

متن کامل

Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors

The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N imag...

متن کامل

Object oriented development method for recon®gurable embedded systems

The authors present a novel method for developing recon®gurable systems targeted at embedded system applications. The paper shows how an existing object oriented design method (MOOSE) has been adapted to include recon®gurable hardware (FPGAs). Previous research on recon®gurable computing has concentrated on the ef®cient mapping of algorithms to FPGAs. It must be realised that recon®gurable hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000